The Generalized Minimum Spanning Tree Problem

نویسنده

  • Petrica C. Pop
چکیده

We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard. We introduce a new mixed integer programming formulation of the problem which contains a polynomial number of constraints and a polynomial number of variables. Based on this formulation we give an heuristic solution, a lower bound procedure and an upper bound procedure and present the advantages of our approach in comparison with an earlier method. We present a solution procedure for solving GMST problem using cutting planes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem

The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...

متن کامل

An Approximation Scheme for the Generalized Geometric Minimum Spanning Tree Problem with Grid Clustering

This paper is concerned with a special case of the Generalized Minimum Spanning Tree Problem. The Generalized Minimum Spanning Tree Problem is defined on an undirected graph, where the vertex set is partitioned into clusters, and non-negative costs are associated with the edges. The problem is to find a tree of minimum cost containing exactly one vertex in each cluster. We consider a geometric ...

متن کامل

An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size

Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree which includes exactly one node from each cluster. It is known that the GMST problem is NP-hard and even finding a near optimal solution is NP-hard. We give an approximation algorithm for the Generalized Minim...

متن کامل

On Some Polynomial Solvable Cases of the Generalized Minimum Spanning Tree Problem

The Generalized Minimum Spanning Tree Problem denoted by GMST is a generalization of the well-known minimum spanning tree problem and belongs to the hard-core of the NP-hard problems. The paper focuses on some special cases when effective polynomial algorithms for solving the GMST problem can be constructed. 2000 Mathematics Subject Classification: 90C05, 90C25, 90C34.

متن کامل

Heuristic Algorithms for the Generalized Minimum Spanning Tree Problem

We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. The aim of this paper is to present an exact exponential time algorithm for the GMST problem as well three heuristic algorithms, two of them based on Prim’s and Kruskal’s algorithms for the minimum spanning tree problem and one based on th...

متن کامل

A Lagrangian Relaxation Approach to the Generalized Minimum Spanning Tree Problem

The Generalized Minimum Spanning Tree Problem, denoted GMST, is a variant of the classical Minimum Spanning Tree problem, and consists of finding a minimum-cost tree spanning a subset of nodes which includes exactly one node from every cluster in an undirected graph whose nodes are partitioned into clusters and whose edges are defined between nodes belonging to different clusters. The GMST prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002